{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VSYZRVDYMI3MXTSIIFXF6HPFOH","short_pith_number":"pith:VSYZRVDY","schema_version":"1.0","canonical_sha256":"acb198d4786236cbce48416e5f1de571cbc8a34d49ae3a0c5008faf6c7f50327","source":{"kind":"arxiv","id":"1110.3314","version":2},"attestation_state":"computed","paper":{"title":"A Ramsey Theorem for Indecomposable Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Fairbanks","submitted_at":"2011-10-14T19:55:59Z","abstract_excerpt":"A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every sufficiently long indecomposable matching contains a long indecomposable matching of one of three types: interleavings, broken nestings, and proper pin sequences."},"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":"1110.3314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-14T19:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"71053ea450805f8a3ce601e5cce99d271a5b1172897b6b0387fb381eec2f8eee","abstract_canon_sha256":"e58efcac412fe00d0765ec645884c912c34b146ca267e95c1df81dceaf4d8690"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:17.386720Z","signature_b64":"sUoOVdtIkYRyx5bsCFSyOogUHH4Ic0zpuezGS0wHYrKb0Zy0/KlpY81v9YgUJ53enudoaGdDfd0CXB983QJkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acb198d4786236cbce48416e5f1de571cbc8a34d49ae3a0c5008faf6c7f50327","last_reissued_at":"2026-05-18T04:07:17.386133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:17.386133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Ramsey Theorem for Indecomposable Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Fairbanks","submitted_at":"2011-10-14T19:55:59Z","abstract_excerpt":"A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every sufficiently long indecomposable matching contains a long indecomposable matching of one of three types: interleavings, broken nestings, and proper pin sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3314","kind":"arxiv","version":2},"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":"1110.3314","created_at":"2026-05-18T04:07:17.386231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3314v2","created_at":"2026-05-18T04:07:17.386231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3314","created_at":"2026-05-18T04:07:17.386231+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSYZRVDYMI3M","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSYZRVDYMI3MXTSI","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSYZRVDY","created_at":"2026-05-18T12:26:44.992195+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/VSYZRVDYMI3MXTSIIFXF6HPFOH","json":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH.json","graph_json":"https://pith.science/api/pith-number/VSYZRVDYMI3MXTSIIFXF6HPFOH/graph.json","events_json":"https://pith.science/api/pith-number/VSYZRVDYMI3MXTSIIFXF6HPFOH/events.json","paper":"https://pith.science/paper/VSYZRVDY"},"agent_actions":{"view_html":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH","download_json":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH.json","view_paper":"https://pith.science/paper/VSYZRVDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3314&json=true","fetch_graph":"https://pith.science/api/pith-number/VSYZRVDYMI3MXTSIIFXF6HPFOH/graph.json","fetch_events":"https://pith.science/api/pith-number/VSYZRVDYMI3MXTSIIFXF6HPFOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH/action/storage_attestation","attest_author":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH/action/author_attestation","sign_citation":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH/action/citation_signature","submit_replication":"https://pith.science/pith/VSYZRVDYMI3MXTSIIFXF6HPFOH/action/replication_record"}},"created_at":"2026-05-18T04:07:17.386231+00:00","updated_at":"2026-05-18T04:07:17.386231+00:00"}