{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MDO2RVPRRYDDJ5POMEMENADS7M","short_pith_number":"pith:MDO2RVPR","schema_version":"1.0","canonical_sha256":"60dda8d5f18e0634f5ee6118468072fb12ce18f730882320c8e25eb87285479f","source":{"kind":"arxiv","id":"2104.14213","version":1},"attestation_state":"computed","paper":{"title":"Graph Similarity and Homomorphism Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jan B\\\"oker","submitted_at":"2021-04-29T09:04:06Z","abstract_excerpt":"We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization based on a natural system of linear equations whose integer solutions correspond to graph isomorphism. By results of Tinhofer (1986, 1991) and Dvo\\v{r}\\'ak (2010), two graphs G and H are fractionally isomorphic if and only if, for every tree T, the number of homomorphisms from T to G equals the corresponding number from T to H, which means that the tree dista"},"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":"2104.14213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-04-29T09:04:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8abadae51a54cc6e98cc314eb12f37e7a55ffa5ca36e6780efbbc7d30856348e","abstract_canon_sha256":"54fbd1e7e66e8447f0b9068e2b6233600eb671b242fc6d970000bb95736921a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:14.328798Z","signature_b64":"YiOGCmcd+LujetAMuI67QrcNs/Kx3injZD4YKDw4zoCiGi73dF4DAPOSYprgMhiUnvkjaDYP+K1joWYC7kScCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60dda8d5f18e0634f5ee6118468072fb12ce18f730882320c8e25eb87285479f","last_reissued_at":"2026-07-05T02:36:14.328388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:14.328388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Similarity and Homomorphism Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jan B\\\"oker","submitted_at":"2021-04-29T09:04:06Z","abstract_excerpt":"We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization based on a natural system of linear equations whose integer solutions correspond to graph isomorphism. By results of Tinhofer (1986, 1991) and Dvo\\v{r}\\'ak (2010), two graphs G and H are fractionally isomorphic if and only if, for every tree T, the number of homomorphisms from T to G equals the corresponding number from T to H, which means that the tree dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14213","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.14213/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.14213","created_at":"2026-07-05T02:36:14.328454+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.14213v1","created_at":"2026-07-05T02:36:14.328454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14213","created_at":"2026-07-05T02:36:14.328454+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDO2RVPRRYDD","created_at":"2026-07-05T02:36:14.328454+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDO2RVPRRYDDJ5PO","created_at":"2026-07-05T02:36:14.328454+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDO2RVPR","created_at":"2026-07-05T02:36:14.328454+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/MDO2RVPRRYDDJ5POMEMENADS7M","json":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M.json","graph_json":"https://pith.science/api/pith-number/MDO2RVPRRYDDJ5POMEMENADS7M/graph.json","events_json":"https://pith.science/api/pith-number/MDO2RVPRRYDDJ5POMEMENADS7M/events.json","paper":"https://pith.science/paper/MDO2RVPR"},"agent_actions":{"view_html":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M","download_json":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M.json","view_paper":"https://pith.science/paper/MDO2RVPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.14213&json=true","fetch_graph":"https://pith.science/api/pith-number/MDO2RVPRRYDDJ5POMEMENADS7M/graph.json","fetch_events":"https://pith.science/api/pith-number/MDO2RVPRRYDDJ5POMEMENADS7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M/action/storage_attestation","attest_author":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M/action/author_attestation","sign_citation":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M/action/citation_signature","submit_replication":"https://pith.science/pith/MDO2RVPRRYDDJ5POMEMENADS7M/action/replication_record"}},"created_at":"2026-07-05T02:36:14.328454+00:00","updated_at":"2026-07-05T02:36:14.328454+00:00"}