{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:LJZO2LITBRA2STIUGPWPZYGHHK","short_pith_number":"pith:LJZO2LIT","schema_version":"1.0","canonical_sha256":"5a72ed2d130c41a94d1433ecfce0c73a9bdfa25f9ce971152ee98c501c04fb86","source":{"kind":"arxiv","id":"cs/0703132","version":1},"attestation_state":"computed","paper":{"title":"Structure induction by lossless graph compression","license":"","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Leonid Peshkin","submitted_at":"2007-03-27T05:46:31Z","abstract_excerpt":"This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example genomic networks. A novel algorithm, dubbed Graphitour, for structure induction by lossless graph compression is presented and illustrated by a clear and broadly known case of nested structure in a DNA molecule. This work extends to graphs some well established approaches to grammatical inference previously applied only to strings. The bottom-up graph compression problem is related to the maximum cardinality (non-bipart"},"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":"cs/0703132","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-03-27T05:46:31Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"76ffb1188cca705c117936e9dde8b73eccd69b6cb2f98821eb8cb751a691edc4","abstract_canon_sha256":"95a9218e0259f51daa0bd4362e51b444da55b47581ff3bf7e7365039dcfb96db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:43.992698Z","signature_b64":"q2ZMcamZmUB8/6D7nkIssdTg7PTlO/iTs7MngIdMfrA2CAa2oo7MMQe/eIqwOZkSppG2uK647mS/NoFefo05BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a72ed2d130c41a94d1433ecfce0c73a9bdfa25f9ce971152ee98c501c04fb86","last_reissued_at":"2026-05-18T00:43:43.992031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:43.992031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure induction by lossless graph compression","license":"","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Leonid Peshkin","submitted_at":"2007-03-27T05:46:31Z","abstract_excerpt":"This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example genomic networks. A novel algorithm, dubbed Graphitour, for structure induction by lossless graph compression is presented and illustrated by a clear and broadly known case of nested structure in a DNA molecule. This work extends to graphs some well established approaches to grammatical inference previously applied only to strings. The bottom-up graph compression problem is related to the maximum cardinality (non-bipart"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0703132","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":"cs/0703132","created_at":"2026-05-18T00:43:43.992137+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0703132v1","created_at":"2026-05-18T00:43:43.992137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0703132","created_at":"2026-05-18T00:43:43.992137+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJZO2LITBRA2","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJZO2LITBRA2STIU","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJZO2LIT","created_at":"2026-05-18T12:25:55.427421+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/LJZO2LITBRA2STIUGPWPZYGHHK","json":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK.json","graph_json":"https://pith.science/api/pith-number/LJZO2LITBRA2STIUGPWPZYGHHK/graph.json","events_json":"https://pith.science/api/pith-number/LJZO2LITBRA2STIUGPWPZYGHHK/events.json","paper":"https://pith.science/paper/LJZO2LIT"},"agent_actions":{"view_html":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK","download_json":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK.json","view_paper":"https://pith.science/paper/LJZO2LIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0703132&json=true","fetch_graph":"https://pith.science/api/pith-number/LJZO2LITBRA2STIUGPWPZYGHHK/graph.json","fetch_events":"https://pith.science/api/pith-number/LJZO2LITBRA2STIUGPWPZYGHHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK/action/storage_attestation","attest_author":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK/action/author_attestation","sign_citation":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK/action/citation_signature","submit_replication":"https://pith.science/pith/LJZO2LITBRA2STIUGPWPZYGHHK/action/replication_record"}},"created_at":"2026-05-18T00:43:43.992137+00:00","updated_at":"2026-05-18T00:43:43.992137+00:00"}