{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3GQJXGO6OZ2RXZNSH2CHMSAVKA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"88531384b234ec22ede2f3cc9170d45e5e5e3d1bb237987aa26f861827c920dc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-10T15:39:30Z","title_canon_sha256":"acf46126be160023f40f106da5d6606bce8bb8667eb9143b57a823f0b588e64e"},"schema_version":"1.0","source":{"id":"1705.03823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03823","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03823v1","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03823","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"3GQJXGO6OZ2R","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3GQJXGO6OZ2RXZNS","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3GQJXGO6","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:9ae417cc8a96b3c477c23452e8d612ff64ff1d8508514c07c0a8a8256087e27c","target":"graph","created_at":"2026-05-18T00:44:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant \"approximate\" prime factorization, is the development of local approaches that cover the graph by factorizable patches and then use this information to derive global factors. We present here a local, quasi-linear al- gorithm for the prime factorization of \"locally unrefined\" graphs with respect to the strong product. To this end we introduce the backbone B(G) for a given graph G and show that the neighborhoods of the backbone vertices pr","authors_text":"Marc Hellmuth, Peter F. Stadler, Werner Kl\\\"ockl, Wilfried Imrich","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-10T15:39:30Z","title":"Local algorithms for the prime factorization of strong product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03823","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f24455e1f03b77743448a4af35fa7089e930e9fec4394db8308a23453692e24a","target":"record","created_at":"2026-05-18T00:44:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"88531384b234ec22ede2f3cc9170d45e5e5e3d1bb237987aa26f861827c920dc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-10T15:39:30Z","title_canon_sha256":"acf46126be160023f40f106da5d6606bce8bb8667eb9143b57a823f0b588e64e"},"schema_version":"1.0","source":{"id":"1705.03823","kind":"arxiv","version":1}},"canonical_sha256":"d9a09b99de76751be5b23e84764815501f9c647f54f9c07cb6dbdc16d898fcdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9a09b99de76751be5b23e84764815501f9c647f54f9c07cb6dbdc16d898fcdd","first_computed_at":"2026-05-18T00:44:42.990875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:42.990875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJj9CVUwMpGsLkj97OptTWyWJpjcBfrb+IN/r93dhZIx90Ac8w42AH+ONyw6B5dnxx9b4EnrK14xIliceDOkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:42.991639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f24455e1f03b77743448a4af35fa7089e930e9fec4394db8308a23453692e24a","sha256:9ae417cc8a96b3c477c23452e8d612ff64ff1d8508514c07c0a8a8256087e27c"],"state_sha256":"96a34cba5273aaefdf760743cb091b479df0c98bc52229803465c6667839721f"}