{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GKTGYJHQWLAZBKPED7IBNYVQB2","short_pith_number":"pith:GKTGYJHQ","canonical_record":{"source":{"id":"1503.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"203f051d3498c49c314b288358200f3ae77474e5a81b03bbdc6f1e5bb8931e8c","abstract_canon_sha256":"1c7f0e104bda570d7fe674bf7b8375d1632920d5cd77b90d712265fd7fb5c85b"},"schema_version":"1.0"},"canonical_sha256":"32a66c24f0b2c190a9e41fd016e2b00e929f49db240a64230df2b37c36064a95","source":{"kind":"arxiv","id":"1503.07363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07363","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07363v2","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07363","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"GKTGYJHQWLAZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GKTGYJHQWLAZBKPE","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GKTGYJHQ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GKTGYJHQWLAZBKPED7IBNYVQB2","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"203f051d3498c49c314b288358200f3ae77474e5a81b03bbdc6f1e5bb8931e8c","abstract_canon_sha256":"1c7f0e104bda570d7fe674bf7b8375d1632920d5cd77b90d712265fd7fb5c85b"},"schema_version":"1.0"},"canonical_sha256":"32a66c24f0b2c190a9e41fd016e2b00e929f49db240a64230df2b37c36064a95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:34.890912Z","signature_b64":"tCBJnGRJDrba5rpl0qsCcFlnTPfc8xZG2qedvVWoRB4hxlE2dfZ1Rvbzc7YV4Uv8W+jenAmc1hRzs8e9qJ9gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32a66c24f0b2c190a9e41fd016e2b00e929f49db240a64230df2b37c36064a95","last_reissued_at":"2026-05-18T01:34:34.890438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:34.890438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07363","source_version":2,"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:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gOm1F0fszqGy1lkbs4v8Mbde2Yx2W0axK1REI3s2q1+vdon06D25Bv5u1cXXvhbP8I+xv+Xteb5SZhkrlzMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:45:54.889099Z"},"content_sha256":"26bd3985f5b345de67b5b6e864d8f5d5fd49ccc3b9cc5e36c81211ab4e9d577e","schema_version":"1.0","event_id":"sha256:26bd3985f5b345de67b5b6e864d8f5d5fd49ccc3b9cc5e36c81211ab4e9d577e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GKTGYJHQWLAZBKPED7IBNYVQB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Original graphs of link graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Jia","submitted_at":"2015-03-25T12:54:53Z","abstract_excerpt":"Let $\\ell \\geqslant 0$ be an integer, and $G$ be a graph without loops. An $\\ell$-link of $G$ is a walk of length $\\ell$ in which consecutive edges are different. We identify an $\\ell$-link with its reverse sequence. The $\\ell$-link graph $\\mathbb{L}_\\ell(G)$ of $G$ is defined to have vertices the $\\ell$-links of $G$, such that two vertices of $\\mathbb{L}_\\ell(G)$ are adjacent if their corresponding $\\ell$-links are the initial and final subsequences of an $(\\ell + 1)$-link of $G$. A graph $G$ is called an $\\ell$-root of a graph $H$ if $\\mathbb{L}_\\ell(G) \\cong H$. For example, $\\mathbb{L}_0(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07363","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"},"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:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94nDqmbRWNIDEJ+wYtTsORsdwsmyf9dKFuDtpQWCpbyLkoebZZyWu3Ds19LhXAyWK83C5dUaBEKlf5O4YSmjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:45:54.889945Z"},"content_sha256":"5d6070b83ee60eac930f708c9fa68784bfd4132eebef520ff10bb71ddec1ee1b","schema_version":"1.0","event_id":"sha256:5d6070b83ee60eac930f708c9fa68784bfd4132eebef520ff10bb71ddec1ee1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKTGYJHQWLAZBKPED7IBNYVQB2/bundle.json","state_url":"https://pith.science/pith/GKTGYJHQWLAZBKPED7IBNYVQB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKTGYJHQWLAZBKPED7IBNYVQB2/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-11T00:45:54Z","links":{"resolver":"https://pith.science/pith/GKTGYJHQWLAZBKPED7IBNYVQB2","bundle":"https://pith.science/pith/GKTGYJHQWLAZBKPED7IBNYVQB2/bundle.json","state":"https://pith.science/pith/GKTGYJHQWLAZBKPED7IBNYVQB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKTGYJHQWLAZBKPED7IBNYVQB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GKTGYJHQWLAZBKPED7IBNYVQB2","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":"1c7f0e104bda570d7fe674bf7b8375d1632920d5cd77b90d712265fd7fb5c85b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:54:53Z","title_canon_sha256":"203f051d3498c49c314b288358200f3ae77474e5a81b03bbdc6f1e5bb8931e8c"},"schema_version":"1.0","source":{"id":"1503.07363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07363","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07363v2","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07363","created_at":"2026-05-18T01:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"GKTGYJHQWLAZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GKTGYJHQWLAZBKPE","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GKTGYJHQ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:5d6070b83ee60eac930f708c9fa68784bfd4132eebef520ff10bb71ddec1ee1b","target":"graph","created_at":"2026-05-18T01:34:34Z","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":"Let $\\ell \\geqslant 0$ be an integer, and $G$ be a graph without loops. An $\\ell$-link of $G$ is a walk of length $\\ell$ in which consecutive edges are different. We identify an $\\ell$-link with its reverse sequence. The $\\ell$-link graph $\\mathbb{L}_\\ell(G)$ of $G$ is defined to have vertices the $\\ell$-links of $G$, such that two vertices of $\\mathbb{L}_\\ell(G)$ are adjacent if their corresponding $\\ell$-links are the initial and final subsequences of an $(\\ell + 1)$-link of $G$. A graph $G$ is called an $\\ell$-root of a graph $H$ if $\\mathbb{L}_\\ell(G) \\cong H$. For example, $\\mathbb{L}_0(G","authors_text":"Bin Jia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:54:53Z","title":"Original graphs of link graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07363","kind":"arxiv","version":2},"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:26bd3985f5b345de67b5b6e864d8f5d5fd49ccc3b9cc5e36c81211ab4e9d577e","target":"record","created_at":"2026-05-18T01:34:34Z","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":"1c7f0e104bda570d7fe674bf7b8375d1632920d5cd77b90d712265fd7fb5c85b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-25T12:54:53Z","title_canon_sha256":"203f051d3498c49c314b288358200f3ae77474e5a81b03bbdc6f1e5bb8931e8c"},"schema_version":"1.0","source":{"id":"1503.07363","kind":"arxiv","version":2}},"canonical_sha256":"32a66c24f0b2c190a9e41fd016e2b00e929f49db240a64230df2b37c36064a95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32a66c24f0b2c190a9e41fd016e2b00e929f49db240a64230df2b37c36064a95","first_computed_at":"2026-05-18T01:34:34.890438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:34.890438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tCBJnGRJDrba5rpl0qsCcFlnTPfc8xZG2qedvVWoRB4hxlE2dfZ1Rvbzc7YV4Uv8W+jenAmc1hRzs8e9qJ9gBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:34.890912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26bd3985f5b345de67b5b6e864d8f5d5fd49ccc3b9cc5e36c81211ab4e9d577e","sha256:5d6070b83ee60eac930f708c9fa68784bfd4132eebef520ff10bb71ddec1ee1b"],"state_sha256":"904997478da5ab76222cf1f3c52e6e580c6ee7c132be21e3d2c5c46f32d15ce1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z734i9dh6ik3tv4DeyViZKeRFGvWkUQhDvbakBFjA7Vj4cjnUdtR4Y0zZ91z2cfVmALfd9LbCvk8BJFDKZuNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:45:54.892725Z","bundle_sha256":"917a3dc6034e6c5e155b4015e5162bba0dd82d057406d3873030d8aeb12bf70f"}}