{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:46H6QMRQLC6BPHOXKNUPIO2Q7L","short_pith_number":"pith:46H6QMRQ","schema_version":"1.0","canonical_sha256":"e78fe8323058bc179dd75368f43b50faf98643ffd2074cec201384caf4c9e15f","source":{"kind":"arxiv","id":"1701.07990","version":2},"attestation_state":"computed","paper":{"title":"Minimal free resolutions of lattice ideals of digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Francesc Planas-Vilanova, Liam O'Carroll","submitted_at":"2017-01-27T10:01:50Z","abstract_excerpt":"Based upon a previous work of Manjunath and Sturmfels for a finite, complete, undirected graph, and a refined algorithm by Er\\\"ocal, Motsak, Schreyer and Steenpa{\\ss} for computing syzygies, we display a free resolution of the lattice ideal associated to a finite, strongly connected, weighted, directed graph. Moreover, the resolution is minimal precisely when the digraph is strongly complete."},"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":"1701.07990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-01-27T10:01:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cc031bb86d1c37285fb47d7b73fee12f419c6224bb28b2204986820c50e4db80","abstract_canon_sha256":"7c963492d287977158f86754c9f3cd236e7dab057a4c817259aa0f0abd46ff13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:48.334089Z","signature_b64":"8cXWJU13EFkUmLuR7jdH+rbWF33Da9+8WFskdcOf+KM+nsPLgA9byk+gt+O7iknDmBZiCxWqjHfCi/l5nMw/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e78fe8323058bc179dd75368f43b50faf98643ffd2074cec201384caf4c9e15f","last_reissued_at":"2026-05-18T00:22:48.333501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:48.333501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal free resolutions of lattice ideals of digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Francesc Planas-Vilanova, Liam O'Carroll","submitted_at":"2017-01-27T10:01:50Z","abstract_excerpt":"Based upon a previous work of Manjunath and Sturmfels for a finite, complete, undirected graph, and a refined algorithm by Er\\\"ocal, Motsak, Schreyer and Steenpa{\\ss} for computing syzygies, we display a free resolution of the lattice ideal associated to a finite, strongly connected, weighted, directed graph. Moreover, the resolution is minimal precisely when the digraph is strongly complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07990","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":"1701.07990","created_at":"2026-05-18T00:22:48.333592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07990v2","created_at":"2026-05-18T00:22:48.333592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07990","created_at":"2026-05-18T00:22:48.333592+00:00"},{"alias_kind":"pith_short_12","alias_value":"46H6QMRQLC6B","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"46H6QMRQLC6BPHOX","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"46H6QMRQ","created_at":"2026-05-18T12:30:58.224056+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/46H6QMRQLC6BPHOXKNUPIO2Q7L","json":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L.json","graph_json":"https://pith.science/api/pith-number/46H6QMRQLC6BPHOXKNUPIO2Q7L/graph.json","events_json":"https://pith.science/api/pith-number/46H6QMRQLC6BPHOXKNUPIO2Q7L/events.json","paper":"https://pith.science/paper/46H6QMRQ"},"agent_actions":{"view_html":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L","download_json":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L.json","view_paper":"https://pith.science/paper/46H6QMRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07990&json=true","fetch_graph":"https://pith.science/api/pith-number/46H6QMRQLC6BPHOXKNUPIO2Q7L/graph.json","fetch_events":"https://pith.science/api/pith-number/46H6QMRQLC6BPHOXKNUPIO2Q7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L/action/storage_attestation","attest_author":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L/action/author_attestation","sign_citation":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L/action/citation_signature","submit_replication":"https://pith.science/pith/46H6QMRQLC6BPHOXKNUPIO2Q7L/action/replication_record"}},"created_at":"2026-05-18T00:22:48.333592+00:00","updated_at":"2026-05-18T00:22:48.333592+00:00"}