{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JLPP66UQPTHBGSJVXFBKSZ6IH3","short_pith_number":"pith:JLPP66UQ","schema_version":"1.0","canonical_sha256":"4adeff7a907cce134935b942a967c83ec9b2bf2b0c71e59fc85061adaed53e9f","source":{"kind":"arxiv","id":"2112.06990","version":1},"attestation_state":"computed","paper":{"title":"Factorization and pseudofactorization of weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Anne Condon, Joseph Berleant, Kristin Sheridan, Mark Bathe, Virginia Vassilevska Williams","submitted_at":"2021-12-13T19:58:15Z","abstract_excerpt":"For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a factorization of $G$. When $G$ is isomorphic to an isometric subgraph of a Cartesian graph product, we call those factors a pseudofactorization of $G$. Prior work has shown that an unweighted graph's pseudofactorization can be used to generate a canonical isometric embedding into a product of the smallest possible pseudofactors. However, for arbitrary weighted graphs,"},"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":"2112.06990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-13T19:58:15Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"79dd047679c9731b9b779ee8b072bb778571afa6a40dd3cc77bf83cca3f4ca78","abstract_canon_sha256":"1b0b38eee657c818653da88089f69738d64ad7b5e5031fc900d28eb34625e222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:19.868373Z","signature_b64":"A8m6Ow5YEruFUI/IQWjSTe7Xt8q8yYQN1lF1dgjCmwmNMRpLwibPWNerQJMiJwTyiHOzOaSk/3pJNlas8HSyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4adeff7a907cce134935b942a967c83ec9b2bf2b0c71e59fc85061adaed53e9f","last_reissued_at":"2026-07-05T03:40:19.867901Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:19.867901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorization and pseudofactorization of weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Anne Condon, Joseph Berleant, Kristin Sheridan, Mark Bathe, Virginia Vassilevska Williams","submitted_at":"2021-12-13T19:58:15Z","abstract_excerpt":"For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a factorization of $G$. When $G$ is isomorphic to an isometric subgraph of a Cartesian graph product, we call those factors a pseudofactorization of $G$. Prior work has shown that an unweighted graph's pseudofactorization can be used to generate a canonical isometric embedding into a product of the smallest possible pseudofactors. However, for arbitrary weighted graphs,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06990","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/2112.06990/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":"2112.06990","created_at":"2026-07-05T03:40:19.867959+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.06990v1","created_at":"2026-07-05T03:40:19.867959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06990","created_at":"2026-07-05T03:40:19.867959+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLPP66UQPTHB","created_at":"2026-07-05T03:40:19.867959+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLPP66UQPTHBGSJV","created_at":"2026-07-05T03:40:19.867959+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLPP66UQ","created_at":"2026-07-05T03:40:19.867959+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.07920","citing_title":"Minimal Isometric Embeddings of Graphs into Cayley Graphs of Finite Abelian Groups","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07939","citing_title":"Dimension and Order Bounds for Isometric Embeddings of Graphs into Abelian Cayley Graphs, and the Abelian Dividend","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3","json":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3.json","graph_json":"https://pith.science/api/pith-number/JLPP66UQPTHBGSJVXFBKSZ6IH3/graph.json","events_json":"https://pith.science/api/pith-number/JLPP66UQPTHBGSJVXFBKSZ6IH3/events.json","paper":"https://pith.science/paper/JLPP66UQ"},"agent_actions":{"view_html":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3","download_json":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3.json","view_paper":"https://pith.science/paper/JLPP66UQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.06990&json=true","fetch_graph":"https://pith.science/api/pith-number/JLPP66UQPTHBGSJVXFBKSZ6IH3/graph.json","fetch_events":"https://pith.science/api/pith-number/JLPP66UQPTHBGSJVXFBKSZ6IH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3/action/storage_attestation","attest_author":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3/action/author_attestation","sign_citation":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3/action/citation_signature","submit_replication":"https://pith.science/pith/JLPP66UQPTHBGSJVXFBKSZ6IH3/action/replication_record"}},"created_at":"2026-07-05T03:40:19.867959+00:00","updated_at":"2026-07-05T03:40:19.867959+00:00"}