{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7ZQITSV4RQKAX5H3EYQFMQWTG2","short_pith_number":"pith:7ZQITSV4","schema_version":"1.0","canonical_sha256":"fe6089cabc8c140bf4fb26205642d336a49fbfd4264bc607ca4cc15f9f6770d3","source":{"kind":"arxiv","id":"1511.07480","version":1},"attestation_state":"computed","paper":{"title":"Parity Separation: A Scientifically Proven Method for Permanent Weight Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Radu Curticapean","submitted_at":"2015-11-23T21:59:00Z","abstract_excerpt":"Given an edge-weighted graph G, let PerfMatch(G) denote the weighted sum over all perfect matchings M in G, weighting each matching M by the product of weights of edges in M. If G is unweighted, this plainly counts the perfect matchings of G.\n  In this paper, we introduce parity separation, a new method for reducing PerfMatch to unweighted instances: For graphs G with edge-weights -1 and 1, we construct two unweighted graphs G1 and G2 such that PerfMatch(G) = PerfMatch(G1) - PerfMatch(G2). This yields a novel weight removal technique for counting perfect matchings, in addition to those known f"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.07480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T21:59:00Z","cross_cats_sorted":[],"title_canon_sha256":"17fc8cd50e7c6ed5c7c9a282fa73041cfdf3b8088f15d5984c4940d468d4ca85","abstract_canon_sha256":"b2c9e27fb96e58654c15bab7ad46de7b58f5c8778f7aac18b4414e4d0bbe27d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.700584Z","signature_b64":"Gv+sHYT4yCzdWfzL1P3NOc7dTlb4QHoTzKOQYE+sZHx6C2ciXVLAlcaUnlrqyHfo4yGlmg1FZZQET4O8+OQ/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe6089cabc8c140bf4fb26205642d336a49fbfd4264bc607ca4cc15f9f6770d3","last_reissued_at":"2026-05-18T01:26:04.700016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.700016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parity Separation: A Scientifically Proven Method for Permanent Weight Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Radu Curticapean","submitted_at":"2015-11-23T21:59:00Z","abstract_excerpt":"Given an edge-weighted graph G, let PerfMatch(G) denote the weighted sum over all perfect matchings M in G, weighting each matching M by the product of weights of edges in M. If G is unweighted, this plainly counts the perfect matchings of G.\n  In this paper, we introduce parity separation, a new method for reducing PerfMatch to unweighted instances: For graphs G with edge-weights -1 and 1, we construct two unweighted graphs G1 and G2 such that PerfMatch(G) = PerfMatch(G1) - PerfMatch(G2). This yields a novel weight removal technique for counting perfect matchings, in addition to those known f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07480","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.07480","created_at":"2026-05-18T01:26:04.700107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07480v1","created_at":"2026-05-18T01:26:04.700107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07480","created_at":"2026-05-18T01:26:04.700107+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZQITSV4RQKA","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZQITSV4RQKAX5H3","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZQITSV4","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2","json":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2.json","graph_json":"https://pith.science/api/pith-number/7ZQITSV4RQKAX5H3EYQFMQWTG2/graph.json","events_json":"https://pith.science/api/pith-number/7ZQITSV4RQKAX5H3EYQFMQWTG2/events.json","paper":"https://pith.science/paper/7ZQITSV4"},"agent_actions":{"view_html":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2","download_json":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2.json","view_paper":"https://pith.science/paper/7ZQITSV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07480&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZQITSV4RQKAX5H3EYQFMQWTG2/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZQITSV4RQKAX5H3EYQFMQWTG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2/action/storage_attestation","attest_author":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2/action/author_attestation","sign_citation":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2/action/citation_signature","submit_replication":"https://pith.science/pith/7ZQITSV4RQKAX5H3EYQFMQWTG2/action/replication_record"}},"created_at":"2026-05-18T01:26:04.700107+00:00","updated_at":"2026-05-18T01:26:04.700107+00:00"}