{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DQOK6CMEX6ARKS3RC2WAQ4W7GT","short_pith_number":"pith:DQOK6CME","canonical_record":{"source":{"id":"1409.6949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T13:24:34Z","cross_cats_sorted":[],"title_canon_sha256":"fba41a0b140c09f40117b87faadd85c6f96c438b3ef5905e9da2d5deeb0324c4","abstract_canon_sha256":"727d796af1fe68cdb5d7402afd24dc13228742d4a0bc516de69fdfbf7352fd5d"},"schema_version":"1.0"},"canonical_sha256":"1c1caf0984bf81154b7116ac0872df34f153c1d418877a18a5137d9200cdedc3","source":{"kind":"arxiv","id":"1409.6949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6949","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6949v1","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6949","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"DQOK6CMEX6AR","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DQOK6CMEX6ARKS3R","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DQOK6CME","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DQOK6CMEX6ARKS3RC2WAQ4W7GT","target":"record","payload":{"canonical_record":{"source":{"id":"1409.6949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T13:24:34Z","cross_cats_sorted":[],"title_canon_sha256":"fba41a0b140c09f40117b87faadd85c6f96c438b3ef5905e9da2d5deeb0324c4","abstract_canon_sha256":"727d796af1fe68cdb5d7402afd24dc13228742d4a0bc516de69fdfbf7352fd5d"},"schema_version":"1.0"},"canonical_sha256":"1c1caf0984bf81154b7116ac0872df34f153c1d418877a18a5137d9200cdedc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:00.152391Z","signature_b64":"2lgCeqMo2YexSgsR2r8ezwRKlxoLcW64drySOs3Oz0ZRr0tIcB+Bfyi41d26X5GMT6OXc2EjJBpRpSNwrRazCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1caf0984bf81154b7116ac0872df34f153c1d418877a18a5137d9200cdedc3","last_reissued_at":"2026-05-18T02:42:00.152012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:00.152012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.6949","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-18T02:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okFdc7zkePoiURS++JdRnzkKeWREgdgX72Rc0Gdd4TaqTYSgisKAFPFD8b0sAcwUOxNYwg4pl1LvCZItgb2eAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:18:42.679713Z"},"content_sha256":"4a5806e1950844adda211f6166ce85d8eb894a9aad0068685407ba03dde7599a","schema_version":"1.0","event_id":"sha256:4a5806e1950844adda211f6166ce85d8eb894a9aad0068685407ba03dde7599a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DQOK6CMEX6ARKS3RC2WAQ4W7GT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some New Results in the Alcuin Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Seify, Hossein Shahmohamad","submitted_at":"2014-09-24T13:24:34Z","abstract_excerpt":"We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on common neighbors) is sufficient as well. By using this classification theorem, we prove some results about class one and class two graphs such as cartesian product of graphs and classification of regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6949","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-18T02:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKpJN4/lg+zOJsI4S8VZ8nViaGM5ZP3oxkn6J0eMh+wxvl6MTQIUW3o+KP1Rk8VcqyFRgaBf4Cf4LtMKAFa5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:18:42.680054Z"},"content_sha256":"a17d2395c5a2982377a3bcf29b5538cd54eb179cf4fd23a07e4f8b0935c2a398","schema_version":"1.0","event_id":"sha256:a17d2395c5a2982377a3bcf29b5538cd54eb179cf4fd23a07e4f8b0935c2a398"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQOK6CMEX6ARKS3RC2WAQ4W7GT/bundle.json","state_url":"https://pith.science/pith/DQOK6CMEX6ARKS3RC2WAQ4W7GT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQOK6CMEX6ARKS3RC2WAQ4W7GT/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-06-05T19:18:42Z","links":{"resolver":"https://pith.science/pith/DQOK6CMEX6ARKS3RC2WAQ4W7GT","bundle":"https://pith.science/pith/DQOK6CMEX6ARKS3RC2WAQ4W7GT/bundle.json","state":"https://pith.science/pith/DQOK6CMEX6ARKS3RC2WAQ4W7GT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQOK6CMEX6ARKS3RC2WAQ4W7GT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DQOK6CMEX6ARKS3RC2WAQ4W7GT","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":"727d796af1fe68cdb5d7402afd24dc13228742d4a0bc516de69fdfbf7352fd5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T13:24:34Z","title_canon_sha256":"fba41a0b140c09f40117b87faadd85c6f96c438b3ef5905e9da2d5deeb0324c4"},"schema_version":"1.0","source":{"id":"1409.6949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6949","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6949v1","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6949","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"DQOK6CMEX6AR","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DQOK6CMEX6ARKS3R","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DQOK6CME","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:a17d2395c5a2982377a3bcf29b5538cd54eb179cf4fd23a07e4f8b0935c2a398","target":"graph","created_at":"2026-05-18T02:42:00Z","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":"We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on common neighbors) is sufficient as well. By using this classification theorem, we prove some results about class one and class two graphs such as cartesian product of graphs and classification of regular graphs.","authors_text":"Abbas Seify, Hossein Shahmohamad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T13:24:34Z","title":"Some New Results in the Alcuin Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6949","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:4a5806e1950844adda211f6166ce85d8eb894a9aad0068685407ba03dde7599a","target":"record","created_at":"2026-05-18T02:42:00Z","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":"727d796af1fe68cdb5d7402afd24dc13228742d4a0bc516de69fdfbf7352fd5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T13:24:34Z","title_canon_sha256":"fba41a0b140c09f40117b87faadd85c6f96c438b3ef5905e9da2d5deeb0324c4"},"schema_version":"1.0","source":{"id":"1409.6949","kind":"arxiv","version":1}},"canonical_sha256":"1c1caf0984bf81154b7116ac0872df34f153c1d418877a18a5137d9200cdedc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c1caf0984bf81154b7116ac0872df34f153c1d418877a18a5137d9200cdedc3","first_computed_at":"2026-05-18T02:42:00.152012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:00.152012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2lgCeqMo2YexSgsR2r8ezwRKlxoLcW64drySOs3Oz0ZRr0tIcB+Bfyi41d26X5GMT6OXc2EjJBpRpSNwrRazCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:00.152391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a5806e1950844adda211f6166ce85d8eb894a9aad0068685407ba03dde7599a","sha256:a17d2395c5a2982377a3bcf29b5538cd54eb179cf4fd23a07e4f8b0935c2a398"],"state_sha256":"adb2bbc97ea87fd89fe48497fa8289651ad93558811236c361825290d8b018b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/ybP5QjSHpZd6GKscXB8VLz1PUyZR3q7vi6Oy8s0svsKxl8Y6wIHazbjP9Jn4luURP3wqsAyrdJrkaWkV5rCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:18:42.682107Z","bundle_sha256":"1e487a81071b9c15f0fb5298480cd584a27a527c4c9dfa1ed7a5a70d6c35cb0d"}}