{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L7UOHMTF5EQDVENHMS7VWSRORH","short_pith_number":"pith:L7UOHMTF","schema_version":"1.0","canonical_sha256":"5fe8e3b265e9203a91a764bf5b4a2e89cd19182a1070b54b751784c8c6af043e","source":{"kind":"arxiv","id":"1706.09480","version":1},"attestation_state":"computed","paper":{"title":"A Temporal Tree Decomposition for Generating Temporal Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Corey Pennycuff, Salvador Aguinaga, Tim Weninger","submitted_at":"2017-06-28T20:47:03Z","abstract_excerpt":"Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. Recent work at the intersection of formal language theory and graph theory has found that a Hyperedge Replacement Grammar (HRG) can be extracted from a tree decomposition of any graph. This HRG can be used to generate new graphs that share properties that are similar to the original graph. Because the extracted HRG is directly dependent on the shape and contents of the of tree decomposition, it is unlikely that informative graph-processes are actually being captured with the extraction"},"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":"1706.09480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2017-06-28T20:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"ccecceaa9b3f5cdef803748161dcc157ffede6282f3f67888542c36d89f167c9","abstract_canon_sha256":"dee9b3071d6d393e97ec171e31653ff236559a4b618fe6eceb66ef15194bbbcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:14.974346Z","signature_b64":"JNCBDZXBMzpuSD+vv0lWpPBvM23KdFDdOMm7gpp2hw3KU2flmztxmVELA1GJVKr97kT6n0+UmRdTrVqwNOQDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe8e3b265e9203a91a764bf5b4a2e89cd19182a1070b54b751784c8c6af043e","last_reissued_at":"2026-05-18T00:41:14.973622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:14.973622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Temporal Tree Decomposition for Generating Temporal Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Corey Pennycuff, Salvador Aguinaga, Tim Weninger","submitted_at":"2017-06-28T20:47:03Z","abstract_excerpt":"Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. Recent work at the intersection of formal language theory and graph theory has found that a Hyperedge Replacement Grammar (HRG) can be extracted from a tree decomposition of any graph. This HRG can be used to generate new graphs that share properties that are similar to the original graph. Because the extracted HRG is directly dependent on the shape and contents of the of tree decomposition, it is unlikely that informative graph-processes are actually being captured with the extraction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09480","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":"1706.09480","created_at":"2026-05-18T00:41:14.973746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09480v1","created_at":"2026-05-18T00:41:14.973746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09480","created_at":"2026-05-18T00:41:14.973746+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7UOHMTF5EQD","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7UOHMTF5EQDVENH","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7UOHMTF","created_at":"2026-05-18T12:31:28.150371+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/L7UOHMTF5EQDVENHMS7VWSRORH","json":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH.json","graph_json":"https://pith.science/api/pith-number/L7UOHMTF5EQDVENHMS7VWSRORH/graph.json","events_json":"https://pith.science/api/pith-number/L7UOHMTF5EQDVENHMS7VWSRORH/events.json","paper":"https://pith.science/paper/L7UOHMTF"},"agent_actions":{"view_html":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH","download_json":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH.json","view_paper":"https://pith.science/paper/L7UOHMTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09480&json=true","fetch_graph":"https://pith.science/api/pith-number/L7UOHMTF5EQDVENHMS7VWSRORH/graph.json","fetch_events":"https://pith.science/api/pith-number/L7UOHMTF5EQDVENHMS7VWSRORH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH/action/storage_attestation","attest_author":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH/action/author_attestation","sign_citation":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH/action/citation_signature","submit_replication":"https://pith.science/pith/L7UOHMTF5EQDVENHMS7VWSRORH/action/replication_record"}},"created_at":"2026-05-18T00:41:14.973746+00:00","updated_at":"2026-05-18T00:41:14.973746+00:00"}