{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MNZMOIZW3JHNP65GIPFSZEP7WB","short_pith_number":"pith:MNZMOIZW","schema_version":"1.0","canonical_sha256":"6372c72336da4ed7fba643cb2c91ffb0540d155801befabf7699afd8d8a39543","source":{"kind":"arxiv","id":"1401.7928","version":2},"attestation_state":"computed","paper":{"title":"On Linkedness of Cartesian Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabor Meszaros","submitted_at":"2014-01-30T17:25:29Z","abstract_excerpt":"We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of product of paths and product of cycles."},"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":"1401.7928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-30T17:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"1c175d408de7cee5847278bbf51ea18fb72a3c6b5e32b35c7db54769466aff99","abstract_canon_sha256":"51572d429f45ed823bd177b85b5c5a8d7f232f2f5142f8ddaf63c424b5ebd48a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:30.952415Z","signature_b64":"3x2V2rvkmo9B71HHlpdRo+LcL2pUQcPbMen2kiNdL8OypBRtJraBBHTuvXUSMACpVHSUIcc1VUp3uDkfH7kjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6372c72336da4ed7fba643cb2c91ffb0540d155801befabf7699afd8d8a39543","last_reissued_at":"2026-05-18T02:46:30.951906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:30.951906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Linkedness of Cartesian Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabor Meszaros","submitted_at":"2014-01-30T17:25:29Z","abstract_excerpt":"We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of product of paths and product of cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7928","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":"1401.7928","created_at":"2026-05-18T02:46:30.951978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7928v2","created_at":"2026-05-18T02:46:30.951978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7928","created_at":"2026-05-18T02:46:30.951978+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNZMOIZW3JHN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNZMOIZW3JHNP65G","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNZMOIZW","created_at":"2026-05-18T12:28:38.356838+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/MNZMOIZW3JHNP65GIPFSZEP7WB","json":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB.json","graph_json":"https://pith.science/api/pith-number/MNZMOIZW3JHNP65GIPFSZEP7WB/graph.json","events_json":"https://pith.science/api/pith-number/MNZMOIZW3JHNP65GIPFSZEP7WB/events.json","paper":"https://pith.science/paper/MNZMOIZW"},"agent_actions":{"view_html":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB","download_json":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB.json","view_paper":"https://pith.science/paper/MNZMOIZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7928&json=true","fetch_graph":"https://pith.science/api/pith-number/MNZMOIZW3JHNP65GIPFSZEP7WB/graph.json","fetch_events":"https://pith.science/api/pith-number/MNZMOIZW3JHNP65GIPFSZEP7WB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB/action/storage_attestation","attest_author":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB/action/author_attestation","sign_citation":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB/action/citation_signature","submit_replication":"https://pith.science/pith/MNZMOIZW3JHNP65GIPFSZEP7WB/action/replication_record"}},"created_at":"2026-05-18T02:46:30.951978+00:00","updated_at":"2026-05-18T02:46:30.951978+00:00"}