{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VM2UIZKGYD5ZO5TTQTY7FBXIVC","short_pith_number":"pith:VM2UIZKG","schema_version":"1.0","canonical_sha256":"ab35446546c0fb97767384f1f286e8a88003b0aa337e333b0be07e70258c0757","source":{"kind":"arxiv","id":"1303.6803","version":3},"attestation_state":"computed","paper":{"title":"Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marc Hellmuth, Tomas Kupka, Wilfried Imrich","submitted_at":"2013-03-27T12:16:31Z","abstract_excerpt":"This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local approach that covers a graph by small subgraphs, so-called partial star products, and then utilizes this information to derive the global factors and an embedding of the graph under investigation into Cartesian product 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":"1303.6803","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-27T12:16:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"530c35db4125fbef50a637c7ed83f1cf81b66d50c8b4f606443100847e538c36","abstract_canon_sha256":"efdb9d335f8b16be7c17f8799ad0e93d4a264cdc0215f9294cf7f42d4a9e7170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:53.090546Z","signature_b64":"cXYjJfLlFoA/fXFnive+u6tHE+DeZNM8q1TsNXg/da5lZGpM5vDkLS5tAJpcSTl7B4SO2Y2RKirrjrIJyQDBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab35446546c0fb97767384f1f286e8a88003b0aa337e333b0be07e70258c0757","last_reissued_at":"2026-05-18T02:47:53.089889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:53.089889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marc Hellmuth, Tomas Kupka, Wilfried Imrich","submitted_at":"2013-03-27T12:16:31Z","abstract_excerpt":"This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local approach that covers a graph by small subgraphs, so-called partial star products, and then utilizes this information to derive the global factors and an embedding of the graph under investigation into Cartesian product graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6803","kind":"arxiv","version":3},"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":"1303.6803","created_at":"2026-05-18T02:47:53.089980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6803v3","created_at":"2026-05-18T02:47:53.089980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6803","created_at":"2026-05-18T02:47:53.089980+00:00"},{"alias_kind":"pith_short_12","alias_value":"VM2UIZKGYD5Z","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VM2UIZKGYD5ZO5TT","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VM2UIZKG","created_at":"2026-05-18T12:28:04.890932+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/VM2UIZKGYD5ZO5TTQTY7FBXIVC","json":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC.json","graph_json":"https://pith.science/api/pith-number/VM2UIZKGYD5ZO5TTQTY7FBXIVC/graph.json","events_json":"https://pith.science/api/pith-number/VM2UIZKGYD5ZO5TTQTY7FBXIVC/events.json","paper":"https://pith.science/paper/VM2UIZKG"},"agent_actions":{"view_html":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC","download_json":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC.json","view_paper":"https://pith.science/paper/VM2UIZKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6803&json=true","fetch_graph":"https://pith.science/api/pith-number/VM2UIZKGYD5ZO5TTQTY7FBXIVC/graph.json","fetch_events":"https://pith.science/api/pith-number/VM2UIZKGYD5ZO5TTQTY7FBXIVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC/action/storage_attestation","attest_author":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC/action/author_attestation","sign_citation":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC/action/citation_signature","submit_replication":"https://pith.science/pith/VM2UIZKGYD5ZO5TTQTY7FBXIVC/action/replication_record"}},"created_at":"2026-05-18T02:47:53.089980+00:00","updated_at":"2026-05-18T02:47:53.089980+00:00"}