{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MAJDZMFOGBQEPNOYBGCNUHJKQW","short_pith_number":"pith:MAJDZMFO","schema_version":"1.0","canonical_sha256":"60123cb0ae306047b5d80984da1d2a85b68929fb225e8cb3facf690b84f41b51","source":{"kind":"arxiv","id":"1405.6527","version":1},"attestation_state":"computed","paper":{"title":"A study 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":"2014-05-26T10:06:35Z","abstract_excerpt":"Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the notions of line graphs and path graphs. An s-link is a walk of length s such that consecutive edges are different. The s-link graph of a given graph G is the graph with vertices the s-links of G, and two vertices are adjacent if their corresponding s-links form an (s + 1)-link; Or equivalently, one corresponding s-link can be shunted to the other in one step. For"},"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":"1405.6527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-26T10:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"f9faf88ec29a4c88405b159d949037b5e9aa4d3a67c5f17de57345abed3b152a","abstract_canon_sha256":"7e5e8da612b560d11095a6469868432d50d2ecd45aa5086b50d5d04219ad743a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:07.178541Z","signature_b64":"kq4swBn0yrvcQfHedzmDrqGnzPRHBFOwyrlIhHoi8HjpuHssLYgRHiZZkdVENRxr8ZbT60aMLrp7Fc8pBI1dDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60123cb0ae306047b5d80984da1d2a85b68929fb225e8cb3facf690b84f41b51","last_reissued_at":"2026-05-18T02:51:07.178033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:07.178033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A study 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":"2014-05-26T10:06:35Z","abstract_excerpt":"Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the notions of line graphs and path graphs. An s-link is a walk of length s such that consecutive edges are different. The s-link graph of a given graph G is the graph with vertices the s-links of G, and two vertices are adjacent if their corresponding s-links form an (s + 1)-link; Or equivalently, one corresponding s-link can be shunted to the other in one step. For"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6527","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.6527","created_at":"2026-05-18T02:51:07.178119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6527v1","created_at":"2026-05-18T02:51:07.178119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6527","created_at":"2026-05-18T02:51:07.178119+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAJDZMFOGBQE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAJDZMFOGBQEPNOY","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAJDZMFO","created_at":"2026-05-18T12:28:38.356838+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/MAJDZMFOGBQEPNOYBGCNUHJKQW","json":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW.json","graph_json":"https://pith.science/api/pith-number/MAJDZMFOGBQEPNOYBGCNUHJKQW/graph.json","events_json":"https://pith.science/api/pith-number/MAJDZMFOGBQEPNOYBGCNUHJKQW/events.json","paper":"https://pith.science/paper/MAJDZMFO"},"agent_actions":{"view_html":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW","download_json":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW.json","view_paper":"https://pith.science/paper/MAJDZMFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6527&json=true","fetch_graph":"https://pith.science/api/pith-number/MAJDZMFOGBQEPNOYBGCNUHJKQW/graph.json","fetch_events":"https://pith.science/api/pith-number/MAJDZMFOGBQEPNOYBGCNUHJKQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW/action/storage_attestation","attest_author":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW/action/author_attestation","sign_citation":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW/action/citation_signature","submit_replication":"https://pith.science/pith/MAJDZMFOGBQEPNOYBGCNUHJKQW/action/replication_record"}},"created_at":"2026-05-18T02:51:07.178119+00:00","updated_at":"2026-05-18T02:51:07.178119+00:00"}