{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3CLUOIUQDIWNVPSZRJMJ5WJ6YZ","short_pith_number":"pith:3CLUOIUQ","schema_version":"1.0","canonical_sha256":"d8974722901a2cdabe598a589ed93ec650b0704a685d60a1e204606d9059e381","source":{"kind":"arxiv","id":"1401.3282","version":1},"attestation_state":"computed","paper":{"title":"Matching groups and gliding systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Turaev","submitted_at":"2014-01-14T18:51:56Z","abstract_excerpt":"With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems."},"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":"1401.3282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T18:51:56Z","cross_cats_sorted":[],"title_canon_sha256":"dd24471b2688484e00ec04c4082aab7125978ddef92d9c3c9e075aa2186892c3","abstract_canon_sha256":"cf21edaf5a54b3bd0ea22c3bd6c04ad4efce1b3f2e47fbb8a86258af55222f87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:45:25.634232Z","signature_b64":"SPrklX9UAGNU8aZsMPXHB01twy+IzL4btwHzU/CBLNXoeg3IZflDFs71aAzl/EWzfYgZmWVEblM8UCBqx39dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8974722901a2cdabe598a589ed93ec650b0704a685d60a1e204606d9059e381","last_reissued_at":"2026-05-18T01:45:25.633763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:45:25.633763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching groups and gliding systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir Turaev","submitted_at":"2014-01-14T18:51:56Z","abstract_excerpt":"With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3282","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":"1401.3282","created_at":"2026-05-18T01:45:25.633842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3282v1","created_at":"2026-05-18T01:45:25.633842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3282","created_at":"2026-05-18T01:45:25.633842+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CLUOIUQDIWN","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CLUOIUQDIWNVPSZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CLUOIUQ","created_at":"2026-05-18T12:28:11.866339+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/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ","json":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ.json","graph_json":"https://pith.science/api/pith-number/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/graph.json","events_json":"https://pith.science/api/pith-number/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/events.json","paper":"https://pith.science/paper/3CLUOIUQ"},"agent_actions":{"view_html":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ","download_json":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ.json","view_paper":"https://pith.science/paper/3CLUOIUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3282&json=true","fetch_graph":"https://pith.science/api/pith-number/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/action/storage_attestation","attest_author":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/action/author_attestation","sign_citation":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/action/citation_signature","submit_replication":"https://pith.science/pith/3CLUOIUQDIWNVPSZRJMJ5WJ6YZ/action/replication_record"}},"created_at":"2026-05-18T01:45:25.633842+00:00","updated_at":"2026-05-18T01:45:25.633842+00:00"}