{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F3JTXC4XCVR2AD5MNPCZAEHQ2E","short_pith_number":"pith:F3JTXC4X","schema_version":"1.0","canonical_sha256":"2ed33b8b971563a00fac6bc59010f0d102b29c7a8e0f6d41dddbafd18899e0d0","source":{"kind":"arxiv","id":"1411.1546","version":2},"attestation_state":"computed","paper":{"title":"Tree decompositions and social graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.AP"],"primary_cat":"cs.DS","authors_text":"Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney","submitted_at":"2014-11-06T09:53:15Z","abstract_excerpt":"Recent work has established that large informatics graphs such as social and information networks have non-trivial tree-like structure when viewed at moderate size scales. Here, we present results from the first detailed empirical evaluation of the use of tree decomposition (TD) heuristics for structure identification and extraction in social graphs. Although TDs have historically been used in structural graph theory and scientific computing, we show that---even with existing TD heuristics developed for those very different areas---TD methods can identify interesting structure in a wide range "},"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":"1411.1546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-06T09:53:15Z","cross_cats_sorted":["cs.SI","physics.soc-ph","stat.AP"],"title_canon_sha256":"7a5a9c33927c09acc80e7f0ef47793d5e91f236c977fd31994e9f465ee96e4d6","abstract_canon_sha256":"c11d7570b8ac60f8bf12403c4638f3c1c74dae10191faffa46ec2aff3e107b01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:53.251501Z","signature_b64":"wvwDwfWCj3gfdM6GrhwPCpCqaEJJDZ4envuMwg6MBoYFUXusQFTIfFpShyJ/Nnan/UmHVQ5AMKuuGs/mIRrhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed33b8b971563a00fac6bc59010f0d102b29c7a8e0f6d41dddbafd18899e0d0","last_reissued_at":"2026-05-18T01:15:53.250952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:53.250952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree decompositions and social graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.AP"],"primary_cat":"cs.DS","authors_text":"Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney","submitted_at":"2014-11-06T09:53:15Z","abstract_excerpt":"Recent work has established that large informatics graphs such as social and information networks have non-trivial tree-like structure when viewed at moderate size scales. Here, we present results from the first detailed empirical evaluation of the use of tree decomposition (TD) heuristics for structure identification and extraction in social graphs. Although TDs have historically been used in structural graph theory and scientific computing, we show that---even with existing TD heuristics developed for those very different areas---TD methods can identify interesting structure in a wide range "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1546","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.1546","created_at":"2026-05-18T01:15:53.251044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1546v2","created_at":"2026-05-18T01:15:53.251044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1546","created_at":"2026-05-18T01:15:53.251044+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3JTXC4XCVR2","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3JTXC4XCVR2AD5M","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3JTXC4X","created_at":"2026-05-18T12:28:28.263976+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/F3JTXC4XCVR2AD5MNPCZAEHQ2E","json":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E.json","graph_json":"https://pith.science/api/pith-number/F3JTXC4XCVR2AD5MNPCZAEHQ2E/graph.json","events_json":"https://pith.science/api/pith-number/F3JTXC4XCVR2AD5MNPCZAEHQ2E/events.json","paper":"https://pith.science/paper/F3JTXC4X"},"agent_actions":{"view_html":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E","download_json":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E.json","view_paper":"https://pith.science/paper/F3JTXC4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1546&json=true","fetch_graph":"https://pith.science/api/pith-number/F3JTXC4XCVR2AD5MNPCZAEHQ2E/graph.json","fetch_events":"https://pith.science/api/pith-number/F3JTXC4XCVR2AD5MNPCZAEHQ2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E/action/storage_attestation","attest_author":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E/action/author_attestation","sign_citation":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E/action/citation_signature","submit_replication":"https://pith.science/pith/F3JTXC4XCVR2AD5MNPCZAEHQ2E/action/replication_record"}},"created_at":"2026-05-18T01:15:53.251044+00:00","updated_at":"2026-05-18T01:15:53.251044+00:00"}