{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SQMXWNVM5MGWO3CW2V7IZC2Y27","short_pith_number":"pith:SQMXWNVM","schema_version":"1.0","canonical_sha256":"94197b36aceb0d676c56d57e8c8b58d7eb9096a719ed75a40b37482876cf8a25","source":{"kind":"arxiv","id":"1807.07992","version":2},"attestation_state":"computed","paper":{"title":"On graphs with 2 trivial distance ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Carlos A. Alfaro","submitted_at":"2018-07-20T18:27:17Z","abstract_excerpt":"Distance ideals generalize the Smith normal form of the distance matrix of a graph. The family of graphs with 2 trivial distance ideals contains the family of graphs whose distance matrix has at most 2 invariant factors equal to 1. Here we give an infinite family of forbidden induced subgraphs for the graphs with 2 trivial distance ideals. These are also related with other well known graph classes."},"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":"1807.07992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-20T18:27:17Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"1312b65cdbda1d1522445709c48b14f05503ad1557e59917fdcaba001b84d5bd","abstract_canon_sha256":"44f683b5a40be3adc067ae7415bf2c482b59d50e98385f82e7480db87418b50c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:58.026835Z","signature_b64":"mh1UAYEqTx8g7DxQuNd+mSwie+aHQt2RkRWhVWRwE3hyigu5k87k50Wi89TOGoSD8P86uwEFUsYEV02xoB4eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94197b36aceb0d676c56d57e8c8b58d7eb9096a719ed75a40b37482876cf8a25","last_reissued_at":"2026-05-18T00:09:58.026090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:58.026090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs with 2 trivial distance ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Carlos A. Alfaro","submitted_at":"2018-07-20T18:27:17Z","abstract_excerpt":"Distance ideals generalize the Smith normal form of the distance matrix of a graph. The family of graphs with 2 trivial distance ideals contains the family of graphs whose distance matrix has at most 2 invariant factors equal to 1. Here we give an infinite family of forbidden induced subgraphs for the graphs with 2 trivial distance ideals. These are also related with other well known graph classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07992","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":"1807.07992","created_at":"2026-05-18T00:09:58.026203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07992v2","created_at":"2026-05-18T00:09:58.026203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07992","created_at":"2026-05-18T00:09:58.026203+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQMXWNVM5MGW","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQMXWNVM5MGWO3CW","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQMXWNVM","created_at":"2026-05-18T12:32:53.628368+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/SQMXWNVM5MGWO3CW2V7IZC2Y27","json":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27.json","graph_json":"https://pith.science/api/pith-number/SQMXWNVM5MGWO3CW2V7IZC2Y27/graph.json","events_json":"https://pith.science/api/pith-number/SQMXWNVM5MGWO3CW2V7IZC2Y27/events.json","paper":"https://pith.science/paper/SQMXWNVM"},"agent_actions":{"view_html":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27","download_json":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27.json","view_paper":"https://pith.science/paper/SQMXWNVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07992&json=true","fetch_graph":"https://pith.science/api/pith-number/SQMXWNVM5MGWO3CW2V7IZC2Y27/graph.json","fetch_events":"https://pith.science/api/pith-number/SQMXWNVM5MGWO3CW2V7IZC2Y27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27/action/storage_attestation","attest_author":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27/action/author_attestation","sign_citation":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27/action/citation_signature","submit_replication":"https://pith.science/pith/SQMXWNVM5MGWO3CW2V7IZC2Y27/action/replication_record"}},"created_at":"2026-05-18T00:09:58.026203+00:00","updated_at":"2026-05-18T00:09:58.026203+00:00"}