{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HSK55ISOUDVWOAVETXTVOL7WEU","short_pith_number":"pith:HSK55ISO","canonical_record":{"source":{"id":"1507.08456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T11:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"94d36a30d00cf5638b8f4157bb5bb7e5dcad9371ea55efbc2a465f8d2101246a","abstract_canon_sha256":"d2eab817ee9d95488dee0ba3b230c5c65f07ea1540c096677ab295223c6f08ad"},"schema_version":"1.0"},"canonical_sha256":"3c95dea24ea0eb6702a49de7572ff6252a34f5dff0ef524ad2d59bf307b9017e","source":{"kind":"arxiv","id":"1507.08456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08456","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08456v1","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08456","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"HSK55ISOUDVW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HSK55ISOUDVWOAVE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HSK55ISO","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HSK55ISOUDVWOAVETXTVOL7WEU","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T11:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"94d36a30d00cf5638b8f4157bb5bb7e5dcad9371ea55efbc2a465f8d2101246a","abstract_canon_sha256":"d2eab817ee9d95488dee0ba3b230c5c65f07ea1540c096677ab295223c6f08ad"},"schema_version":"1.0"},"canonical_sha256":"3c95dea24ea0eb6702a49de7572ff6252a34f5dff0ef524ad2d59bf307b9017e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:06.408418Z","signature_b64":"awH+26O7WUxqMWbseLlWPXvhPxcuy4C+wdSjjT+I0ewSk514XqAKpHm8YYBpib+hRj0uVPm8l4WTF1FN4dv0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c95dea24ea0eb6702a49de7572ff6252a34f5dff0ef524ad2d59bf307b9017e","last_reissued_at":"2026-05-18T01:36:06.407917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:06.407917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08456","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5Wrl/7OmNNkzDGYHuopuuR5GIW4Y3Vn09BDOnvzIId11rKTndBwf8jPoVCpEGTAnDJpy2M3mdCTkNjF6RJfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:45:23.579905Z"},"content_sha256":"e228fe0cd4e0e7291a71a5d06258642d34172e2237af25291aa1324114518ea8","schema_version":"1.0","event_id":"sha256:e228fe0cd4e0e7291a71a5d06258642d34172e2237af25291aa1324114518ea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HSK55ISOUDVWOAVETXTVOL7WEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Chromatic Number of Matching Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2015-07-30T11:12:10Z","abstract_excerpt":"In an earlier paper, the present authors (2013) introduced the altermatic number of graphs and used Tucker's Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the altermatic number is a lower bound for the chromatic number. A matching graph has the set of all matchings of a specified size of a graph as vertex set and two vertices are adjacent if the corresponding matchings are edge-disjoint. It is known that the Kneser graphs, the Schrijver graphs, and the permutation graphs can be represented by matching graphs. In this paper, as a generalization of the well-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08456","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTcHJLnukAtA1+y/Ve2VQeRWMZLi3REp0UyZdDWvcwvmq6aSjlt4Weg78llxmfVEjHbxm2YnmV+47OYF3qFrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:45:23.580248Z"},"content_sha256":"301add88254a2ffd66b7dafe6969720cb9d317ebd549accbef63f4a2f2007bfc","schema_version":"1.0","event_id":"sha256:301add88254a2ffd66b7dafe6969720cb9d317ebd549accbef63f4a2f2007bfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSK55ISOUDVWOAVETXTVOL7WEU/bundle.json","state_url":"https://pith.science/pith/HSK55ISOUDVWOAVETXTVOL7WEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSK55ISOUDVWOAVETXTVOL7WEU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T21:45:23Z","links":{"resolver":"https://pith.science/pith/HSK55ISOUDVWOAVETXTVOL7WEU","bundle":"https://pith.science/pith/HSK55ISOUDVWOAVETXTVOL7WEU/bundle.json","state":"https://pith.science/pith/HSK55ISOUDVWOAVETXTVOL7WEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSK55ISOUDVWOAVETXTVOL7WEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HSK55ISOUDVWOAVETXTVOL7WEU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d2eab817ee9d95488dee0ba3b230c5c65f07ea1540c096677ab295223c6f08ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T11:12:10Z","title_canon_sha256":"94d36a30d00cf5638b8f4157bb5bb7e5dcad9371ea55efbc2a465f8d2101246a"},"schema_version":"1.0","source":{"id":"1507.08456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08456","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08456v1","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08456","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"HSK55ISOUDVW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HSK55ISOUDVWOAVE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HSK55ISO","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:301add88254a2ffd66b7dafe6969720cb9d317ebd549accbef63f4a2f2007bfc","target":"graph","created_at":"2026-05-18T01:36:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In an earlier paper, the present authors (2013) introduced the altermatic number of graphs and used Tucker's Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the altermatic number is a lower bound for the chromatic number. A matching graph has the set of all matchings of a specified size of a graph as vertex set and two vertices are adjacent if the corresponding matchings are edge-disjoint. It is known that the Kneser graphs, the Schrijver graphs, and the permutation graphs can be represented by matching graphs. In this paper, as a generalization of the well-","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T11:12:10Z","title":"On The Chromatic Number of Matching Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08456","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e228fe0cd4e0e7291a71a5d06258642d34172e2237af25291aa1324114518ea8","target":"record","created_at":"2026-05-18T01:36:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d2eab817ee9d95488dee0ba3b230c5c65f07ea1540c096677ab295223c6f08ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T11:12:10Z","title_canon_sha256":"94d36a30d00cf5638b8f4157bb5bb7e5dcad9371ea55efbc2a465f8d2101246a"},"schema_version":"1.0","source":{"id":"1507.08456","kind":"arxiv","version":1}},"canonical_sha256":"3c95dea24ea0eb6702a49de7572ff6252a34f5dff0ef524ad2d59bf307b9017e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c95dea24ea0eb6702a49de7572ff6252a34f5dff0ef524ad2d59bf307b9017e","first_computed_at":"2026-05-18T01:36:06.407917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:06.407917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"awH+26O7WUxqMWbseLlWPXvhPxcuy4C+wdSjjT+I0ewSk514XqAKpHm8YYBpib+hRj0uVPm8l4WTF1FN4dv0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:06.408418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e228fe0cd4e0e7291a71a5d06258642d34172e2237af25291aa1324114518ea8","sha256:301add88254a2ffd66b7dafe6969720cb9d317ebd549accbef63f4a2f2007bfc"],"state_sha256":"d58a25e71caed769a9593619563cc1def478fc564e77b5d1068c157a5293dada"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Ao3DEwQBVR4tliMR/Mt252ZfkGeaiQxnLN7KIdjR8fWk1Hs/B7FVLwG/MmH+iFcw0DkthM7gmixdp+kNINDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T21:45:23.582188Z","bundle_sha256":"14d756a5db8a4ee7bdf10d46e13c7af3e1f67dff8116806e9f12855c92365623"}}