{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MDBBJ6T66MO4UGVNNFMAU576ES","short_pith_number":"pith:MDBBJ6T6","schema_version":"1.0","canonical_sha256":"60c214fa7ef31dca1aad69580a77fe24aa4c8fbfb6f91aed0907d7c59fd5650e","source":{"kind":"arxiv","id":"1403.3548","version":2},"attestation_state":"computed","paper":{"title":"Almost all friendly matrices have many obstructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2014-03-14T12:12:38Z","abstract_excerpt":"A symmetric $m\\times m$ matrix $M$ with entries taken from $\\{0,1,\\ast\\}$ gives rise to a graph partition problem, asking whether a graph can be partitioned into $m$ vertex sets matched to the rows (and corresponding columns) of $M$ such that, if $M_{ij}=1$, then any two vertices between the corresponding vertex sets are joined by an edge, and if $M_{ij}=0$ then any two vertices between the corresponding vertex sets are not joined by an edge. The entry $\\ast$ places no restriction on the edges between the corresponding sets. This problem generalises graph colouring and graph homomorphism probl"},"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":"1403.3548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-14T12:12:38Z","cross_cats_sorted":[],"title_canon_sha256":"75b72a6599b61d66f36f548234153c5207931e713b4e01824b8a3a2bae040deb","abstract_canon_sha256":"76dccfed966615ab8ea0900bd1a217ce3fa1a0c37576a86d2d4823794baea12e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:21.301921Z","signature_b64":"ezFSOp3ajH9XavHskQFAxqqUVY4LY7lk+VZXGDdfFOpo5jeUIey57A2u2vCDx9ZXkAdwyxwJFp+L6Q4NEO/KCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60c214fa7ef31dca1aad69580a77fe24aa4c8fbfb6f91aed0907d7c59fd5650e","last_reissued_at":"2026-05-18T02:31:21.301473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:21.301473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost all friendly matrices have many obstructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2014-03-14T12:12:38Z","abstract_excerpt":"A symmetric $m\\times m$ matrix $M$ with entries taken from $\\{0,1,\\ast\\}$ gives rise to a graph partition problem, asking whether a graph can be partitioned into $m$ vertex sets matched to the rows (and corresponding columns) of $M$ such that, if $M_{ij}=1$, then any two vertices between the corresponding vertex sets are joined by an edge, and if $M_{ij}=0$ then any two vertices between the corresponding vertex sets are not joined by an edge. The entry $\\ast$ places no restriction on the edges between the corresponding sets. This problem generalises graph colouring and graph homomorphism probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3548","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":"1403.3548","created_at":"2026-05-18T02:31:21.301539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3548v2","created_at":"2026-05-18T02:31:21.301539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3548","created_at":"2026-05-18T02:31:21.301539+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDBBJ6T66MO4","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDBBJ6T66MO4UGVN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDBBJ6T6","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/MDBBJ6T66MO4UGVNNFMAU576ES","json":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES.json","graph_json":"https://pith.science/api/pith-number/MDBBJ6T66MO4UGVNNFMAU576ES/graph.json","events_json":"https://pith.science/api/pith-number/MDBBJ6T66MO4UGVNNFMAU576ES/events.json","paper":"https://pith.science/paper/MDBBJ6T6"},"agent_actions":{"view_html":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES","download_json":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES.json","view_paper":"https://pith.science/paper/MDBBJ6T6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3548&json=true","fetch_graph":"https://pith.science/api/pith-number/MDBBJ6T66MO4UGVNNFMAU576ES/graph.json","fetch_events":"https://pith.science/api/pith-number/MDBBJ6T66MO4UGVNNFMAU576ES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES/action/storage_attestation","attest_author":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES/action/author_attestation","sign_citation":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES/action/citation_signature","submit_replication":"https://pith.science/pith/MDBBJ6T66MO4UGVNNFMAU576ES/action/replication_record"}},"created_at":"2026-05-18T02:31:21.301539+00:00","updated_at":"2026-05-18T02:31:21.301539+00:00"}