{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QBFGYLALQTPPPL2ZJRFNLCTIGM","short_pith_number":"pith:QBFGYLAL","canonical_record":{"source":{"id":"1410.8637","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T04:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"2f752b1f0f2109c3c8235847a047ff963b8981a62fe424b1884722fae8d6f136","abstract_canon_sha256":"26c26f037781539c549e666b3c166145fb321fa2684af5c2d496618fb19d959f"},"schema_version":"1.0"},"canonical_sha256":"804a6c2c0b84def7af594c4ad58a6833002b955ec52715fbe5ecceffd2520e26","source":{"kind":"arxiv","id":"1410.8637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8637","created_at":"2026-05-18T02:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8637v1","created_at":"2026-05-18T02:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8637","created_at":"2026-05-18T02:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"QBFGYLALQTPP","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QBFGYLALQTPPPL2Z","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QBFGYLAL","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QBFGYLALQTPPPL2ZJRFNLCTIGM","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8637","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T04:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"2f752b1f0f2109c3c8235847a047ff963b8981a62fe424b1884722fae8d6f136","abstract_canon_sha256":"26c26f037781539c549e666b3c166145fb321fa2684af5c2d496618fb19d959f"},"schema_version":"1.0"},"canonical_sha256":"804a6c2c0b84def7af594c4ad58a6833002b955ec52715fbe5ecceffd2520e26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:54.045467Z","signature_b64":"+wa+xa4GlqzdkifdnPBCisUwW0GcSPAUMj6GCDcC+n6XYF/RGis69ryx1WFkEmPqzMzZ/zmtMV/EXetwZCgWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"804a6c2c0b84def7af594c4ad58a6833002b955ec52715fbe5ecceffd2520e26","last_reissued_at":"2026-05-18T02:38:54.045055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:54.045055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8637","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:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+G+eokmWArE4gmz8G4NCSA9UZRxFgIfqkcEWl6IC42jrJtd1RPgBlqEBzzjY7TK5gtD7Bc5v+g3QrTx7LfxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:05:39.433810Z"},"content_sha256":"91294d17f78eaa203d59515a173bff655558a3ddf80ef94009f4ed205e45d3e4","schema_version":"1.0","event_id":"sha256:91294d17f78eaa203d59515a173bff655558a3ddf80ef94009f4ed205e45d3e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QBFGYLALQTPPPL2ZJRFNLCTIGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Introduction to the McPherson number, $\\Upsilon(G)$ of a simple connected graph","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Susanth C","submitted_at":"2014-10-31T04:44:09Z","abstract_excerpt":"The concept of the \\emph{McPherson number} of a simple connected graph $G$ on $n$ vertices denoted by $\\Upsilon(G)$, is introduced. The recursive concept, called the \\emph{McPherson recursion}, is a series of \\emph{vertex explosions} such that on the first interation a vertex $v \\in V(G)$ explodes to arc (directed edges) to all vertices $u \\in V(G)$ for which the edge $vu \\notin E(G)$, to obtain the mixed graph $G'_1.$ Now $G'_1$ is considered on the second iteration and a vertex $w \\in V(G'_1) = V(G)$ may explode to arc to all vertices $z \\in V(G'_1)$ if edge $wz \\notin E(G)$ and arc $(w, z)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8637","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:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4sVspcB+UdJb+5xyjlrtDMDFPr+cHQGomY7oWIZBmfsvIfuPhB/rCs/730ur+VbOHyHyDQrUo5SjPbOciSOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:05:39.434160Z"},"content_sha256":"61c4f56ced16e1003a93e14e750381b75da625f4f9863b3ef5855b44d9ce2fe5","schema_version":"1.0","event_id":"sha256:61c4f56ced16e1003a93e14e750381b75da625f4f9863b3ef5855b44d9ce2fe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBFGYLALQTPPPL2ZJRFNLCTIGM/bundle.json","state_url":"https://pith.science/pith/QBFGYLALQTPPPL2ZJRFNLCTIGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBFGYLALQTPPPL2ZJRFNLCTIGM/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-03T22:05:39Z","links":{"resolver":"https://pith.science/pith/QBFGYLALQTPPPL2ZJRFNLCTIGM","bundle":"https://pith.science/pith/QBFGYLALQTPPPL2ZJRFNLCTIGM/bundle.json","state":"https://pith.science/pith/QBFGYLALQTPPPL2ZJRFNLCTIGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBFGYLALQTPPPL2ZJRFNLCTIGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QBFGYLALQTPPPL2ZJRFNLCTIGM","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":"26c26f037781539c549e666b3c166145fb321fa2684af5c2d496618fb19d959f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T04:44:09Z","title_canon_sha256":"2f752b1f0f2109c3c8235847a047ff963b8981a62fe424b1884722fae8d6f136"},"schema_version":"1.0","source":{"id":"1410.8637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8637","created_at":"2026-05-18T02:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8637v1","created_at":"2026-05-18T02:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8637","created_at":"2026-05-18T02:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"QBFGYLALQTPP","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QBFGYLALQTPPPL2Z","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QBFGYLAL","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:61c4f56ced16e1003a93e14e750381b75da625f4f9863b3ef5855b44d9ce2fe5","target":"graph","created_at":"2026-05-18T02:38:54Z","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":"The concept of the \\emph{McPherson number} of a simple connected graph $G$ on $n$ vertices denoted by $\\Upsilon(G)$, is introduced. The recursive concept, called the \\emph{McPherson recursion}, is a series of \\emph{vertex explosions} such that on the first interation a vertex $v \\in V(G)$ explodes to arc (directed edges) to all vertices $u \\in V(G)$ for which the edge $vu \\notin E(G)$, to obtain the mixed graph $G'_1.$ Now $G'_1$ is considered on the second iteration and a vertex $w \\in V(G'_1) = V(G)$ may explode to arc to all vertices $z \\in V(G'_1)$ if edge $wz \\notin E(G)$ and arc $(w, z)$","authors_text":"Johan Kok, Susanth C","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T04:44:09Z","title":"Introduction to the McPherson number, $\\Upsilon(G)$ of a simple connected graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8637","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:91294d17f78eaa203d59515a173bff655558a3ddf80ef94009f4ed205e45d3e4","target":"record","created_at":"2026-05-18T02:38:54Z","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":"26c26f037781539c549e666b3c166145fb321fa2684af5c2d496618fb19d959f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-10-31T04:44:09Z","title_canon_sha256":"2f752b1f0f2109c3c8235847a047ff963b8981a62fe424b1884722fae8d6f136"},"schema_version":"1.0","source":{"id":"1410.8637","kind":"arxiv","version":1}},"canonical_sha256":"804a6c2c0b84def7af594c4ad58a6833002b955ec52715fbe5ecceffd2520e26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"804a6c2c0b84def7af594c4ad58a6833002b955ec52715fbe5ecceffd2520e26","first_computed_at":"2026-05-18T02:38:54.045055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:54.045055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+wa+xa4GlqzdkifdnPBCisUwW0GcSPAUMj6GCDcC+n6XYF/RGis69ryx1WFkEmPqzMzZ/zmtMV/EXetwZCgWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:54.045467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91294d17f78eaa203d59515a173bff655558a3ddf80ef94009f4ed205e45d3e4","sha256:61c4f56ced16e1003a93e14e750381b75da625f4f9863b3ef5855b44d9ce2fe5"],"state_sha256":"16c63037b7bef72a69727495161b8422552f9e696a3c589b2e9911fd601749da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tr4lHwfvokFJa1AqyWnFHTdja1o4VzSSQS1qRJylGnCwkzkPkxjNCWfgb+8zqSanTQ/TYyRkyaruiaW1ohttCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:05:39.436286Z","bundle_sha256":"d1a86fc271faf95c8ad981bad144cb851a331a1ef6265a38f2ffacc9db533c3d"}}