{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T44JSNQDZZ2BWPUUULDTSMTP3G","short_pith_number":"pith:T44JSNQD","schema_version":"1.0","canonical_sha256":"9f38993603ce741b3e94a2c739326fd9afea73cfb2b5595006c3cf0c1fd0419c","source":{"kind":"arxiv","id":"1607.07426","version":1},"attestation_state":"computed","paper":{"title":"Symmetric Graphs have symmetric Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Jan Fricke","submitted_at":"2016-07-25T19:45:45Z","abstract_excerpt":"Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for amenable groups: if there is a perfect matching on the graph, there is also a perfect matching on the factor graph, i. e. a group invariant (\"symmetric\") perfect matching on the graph."},"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":"1607.07426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-07-25T19:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"4481ea12e79cd5fab2a2bbb96b65e5949e0e1de70a3ebe4e513a2204cb1d193a","abstract_canon_sha256":"836f2f77c364e3c33293e9998cd40cf8742295bbe3bbd67e8c7a91842c9ed170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:33.963761Z","signature_b64":"2DhODAgmp0EcDE6aT7+XNBQMDRlPPxjN9aC/0LuuDy/u5ol9WWEIQiS0WSn3W1Ut07//wEYWkIn4wwkJbE+UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f38993603ce741b3e94a2c739326fd9afea73cfb2b5595006c3cf0c1fd0419c","last_reissued_at":"2026-05-18T01:10:33.963299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:33.963299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Graphs have symmetric Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Jan Fricke","submitted_at":"2016-07-25T19:45:45Z","abstract_excerpt":"Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for amenable groups: if there is a perfect matching on the graph, there is also a perfect matching on the factor graph, i. e. a group invariant (\"symmetric\") perfect matching on the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07426","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":"1607.07426","created_at":"2026-05-18T01:10:33.963369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07426v1","created_at":"2026-05-18T01:10:33.963369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07426","created_at":"2026-05-18T01:10:33.963369+00:00"},{"alias_kind":"pith_short_12","alias_value":"T44JSNQDZZ2B","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T44JSNQDZZ2BWPUU","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T44JSNQD","created_at":"2026-05-18T12:30:44.179134+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/T44JSNQDZZ2BWPUUULDTSMTP3G","json":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G.json","graph_json":"https://pith.science/api/pith-number/T44JSNQDZZ2BWPUUULDTSMTP3G/graph.json","events_json":"https://pith.science/api/pith-number/T44JSNQDZZ2BWPUUULDTSMTP3G/events.json","paper":"https://pith.science/paper/T44JSNQD"},"agent_actions":{"view_html":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G","download_json":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G.json","view_paper":"https://pith.science/paper/T44JSNQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07426&json=true","fetch_graph":"https://pith.science/api/pith-number/T44JSNQDZZ2BWPUUULDTSMTP3G/graph.json","fetch_events":"https://pith.science/api/pith-number/T44JSNQDZZ2BWPUUULDTSMTP3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G/action/storage_attestation","attest_author":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G/action/author_attestation","sign_citation":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G/action/citation_signature","submit_replication":"https://pith.science/pith/T44JSNQDZZ2BWPUUULDTSMTP3G/action/replication_record"}},"created_at":"2026-05-18T01:10:33.963369+00:00","updated_at":"2026-05-18T01:10:33.963369+00:00"}